Scaling sparse matrix-matrix multiplication in the accumulo database
نویسندگان
چکیده
منابع مشابه
Coded Sparse Matrix Multiplication
In a large-scale and distributed matrix multiplication problem C = AB, where C ∈ Rr×t, the coded computation plays an important role to effectively deal with “stragglers” (distributed computations that may get delayed due to few slow or faulty processors). However, existing coded schemes could destroy the significant sparsity that exists in large-scale machine learning problems, and could resul...
متن کاملHighly Parallel Sparse Matrix-Matrix Multiplication
Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on two-dimensional block distribution of sparse matrices where serial sections use a novel hyperspa...
متن کاملParallel Sparse Matrix Multiplication for Linear Scaling Electronic Structure Calculations
Linear-scaling electronic-structure techniques, also called O(N) techniques, rely heavily on the multiplication of sparse matrices, where the sparsity arises from spatial cut-offs. In order to treat very large systems, the calculations must be run on parallel computers. We analyse the problem of parallelising the multiplication of sparse matrices with the sparsity pattern required by linear-sca...
متن کاملSparse matrix multiplication package (SMMP)
Routines callable from FORTRAN and C are described which implement matrix–matrix multiplication and transposition for a variety of sparse matrix formats. Conversion routines between various formats are provided.
متن کاملSparse Matrix Multiplication Using UPC
Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide, they make distributing data and operating on ghost zones relatively easy. Meanwhile, they provide thread-data affinity that can enable locality exploitation. In this paper, we are considering sparse matrix multiplicatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed and Parallel Databases
سال: 2019
ISSN: 0926-8782,1573-7578
DOI: 10.1007/s10619-019-07257-y